Math 661 Fall 2013 Homework 1 Solutions

نویسنده

  • Drew Armstrong
چکیده

Proof. First suppose that a ∼H b, so that a = bk for some k ∈ H, and let ah (with h ∈ H) be an artibrary element of aH. Then we have ah = bkh = b(kh) ∈ bH, hence aH ⊆ bH. The proof of bH ⊆ aH is similar. Conversely, suppose that aH = bH. Since a ∈ aH = bH we have a = bk for some k ∈ H. Then a−1b = k−1 ∈ H, hence a ∼H b. (d) Prove that the map g 7→ ag is a bijection from H to aH. Proof. Consider the map G→ G defined by g 7→ a−1g. Since an arbitrary element of aH looks like ah for some h ∈ H we see that the map sends aH → H. Since this maps also inverts the map g 7→ ag we conclude that both maps are bijective.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Math 661 Fall 2013 Homework 5 Drew Armstrong

(a) Prove that [G,G]CG. (b) Prove that the quotient Gab := G/[G,G] (called the abelianization of G) is abelian. (c) If N CG is any normal subgroup such that G/N is abelian, prove that [G,G] ≤ N . (d) Put everything together to prove the universal property of abelianization: Given a homomorphism φ : G→ A to an abelian group A, there exists a unique homomorphism φ̄ := Gab → A such that φ = φ̄ ◦ π, ...

متن کامل

Umass Amherst Math 411 Section 2 , Fall 2009

READINGS: These notes are intended as a supplement to the textbook, not a replacement for it. This homework has two sections. The first section covers material from Math 300; I am not requiring you to do the first section, but I am including it for those students who need a reminder about partitions and equivalence classes. **** ONLY HAND IN SECTION 2 **** But feel free to solve the problems in...

متن کامل

Fall 2017, MATH 4707 (UMN) Homework 1 solutions

f1 = f2 = 1. Now, we need to show the recurrence relation. Suppose that fn−1 and fn−2 count the tilings on a 2 × (n − 2) and 2 × (n − 3) board respectively. Now, consider a 2 × (n − 1) board. For each tiling, we can either have a vertical domino in the first column, or a horizontal domino that covers the first and second columns. In the first case, we just have a 2 × (n − 2) board remaining. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013